FIXED LOOKAHEAD PARSING OF REGULAR GRAMMARS BY FINITE STATE MACHINESOSTRAND TJ; PAULL MC; WEYUKER EJ et al.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 340-345; BIBL. 2 REF.Conference Paper

A NEW HEURISTIC FOR INFERRING REGULAR GRAMMARSITOGA SY.1981; I.E.E.E. TRANS. PATTERN ANAL. MACH. INTELL.; USA; DA. 1981; VOL. 3; NO 2; PP. 191-197; BIBL. 9 REF.Article

MULTIPLE INFERENCE IN REGULAR GRAMMARSMICLET L.sdINTERNATIONAL JOINT CONFERENCE ON PATTERN RECOGNITION. 4/1978/KYOTO; JPN; DA. S.D.; PP. 341-345; BIBL. 11 REF.Conference Paper

ON LL-REGULAR GRAMMARSPOPLAWSKI DA.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 18; NO 3; PP. 218-227; BIBL. 9 REF.Article

INFERENCE D'AUTOMATES FINIS PAR "COMPARAISON DE FINALES" = INFERENCE OF FINITE AUTOMATA BY "COMPARISON OF FINALS"MICLET LAURENT.1979; ; FRA; PARIS: ENST; DA. 1979; ENST-C/79019; (8) P.; 30 CM; BIBL. 6 REF.Report

THE EQUIVALENCE PROBLEM FOR LL- AND LR-REGULAR GRAMMARS (EXTENDED ABSTRACT)NIJHOLT A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 291-300; BIBL. 21 REF.Conference Paper

REGULAR INFERENCE WITH A "TAIL - CLUSTERING" METHODMICLET LAURENT.1979; ; FRA; PARIS: ENST; DA. 1979; ENST-D/79011; 15 P.; 30 CM; BIBL. 9 REF.; DEPARTEMENT SYSTEMES ET COMMUNICATIONSReport

INFERENCE D'AUTOMATES FINIS PAR "COMPARAISON DE FINALES"MICLET L.1979; RECONNAISSANCE DES FORMES ET INTELLIGENCE ARTIFICIELLE. ASSOCIATION FRANCAISE POUR LA CYBERNETIQUE ECONOMIQUE ET TECHNIQUE. INSTITUT DE RECHERCHE D'INFORMATIQUE ET D'AUTOMATIQUE. CONGRES. 2/1979/TOULOUSE; FRA; ROCQUENCOURT: IRIA; DA. 1979; VOL. 1; PP. 389-396; BIBL. 6 REF.Conference Paper

REGULAR INFERENCE WITH A TAIL-CLUSTERING METHODMICLET L.1980; IEEE TRANS. SYST. MAN CYBERN.; ISSN 0018-9472; USA; DA. 1980; VOL. 10; NO 11; PP. 737-743; BIBL. 12 REF.Article

FROM LEFT-REGULAR TO GREIBACH NORMAL FORM GRAMMARSNIJHOLT A.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 1; PP. 51-55; BIBL. 14 REF.Article

Regular inference with a tail-clustering-methodMICLET, Laurent.1980, 8 p.Report

PARSING REGULAR GRAMMARS WITH FINITE LOOKAHEADOSTRAND TJ; PAULL MC; WEYUKER EJ et al.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 2; PP. 125-138; BIBL. 6 REF.Article

SYNTAKTYCZNE ANALIZATORY KONTUROW JAKO PARSERY GRAMATYK O REGULARNEJ PROEWEJ STRONIE (RRP) = ANALYSEURS SYNTAXIQUES DES CONTOURS COMME ANALYSEURS DE GRAMMAIRES REGULIERES DROITESJAKUBOWSKI R; MOSZNER P.1980; PODSTAWY STEROWAN.; POL; DA. 1980; VOL. 10; NO 4; PP. 363-378; ABS. ENG/RUS; BIBL. 7 REF.Article

EXTENDING LOOKAHEAD FOR LR PARSERSBAKER TP.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 2; PP. 243-259; BIBL. 14 REF.Article

LL-REGULAR GRAMMARSNIJHOLT A.1980; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1980; VOL. 8; NO 4; PP. 303-318; BIBL. 16 REF.Article

OBSERVATIONS ON THE COMPLEXITY OF REGULAR EXPRESSION PROBLEMSHUNT HB III.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 3; PP. 222-236; BIBL. 17 REF.Article

ON THE GENERATIVE CAPACITY OF TREE CONTROLLED GRAMMARSPAUN G.1979; COMPUTING; AUT; DA. 1979; VOL. 21; NO 3; PP. 213-220; ABS. GER; BIBL. 5 REF.Article

MULTIPLE INFERENCE IN REGULAR GRAMMARS = MULTIPLE METHODE D'INFERENCE DANS LES GRAMMAIRES REGULIERESMICLET LAURENT.1978; ; FRA; PARIS: ENST; DA. 1978; ENST-C/78016; 19 P.; 30 CM; BIBL. 11 REF.Report

FINITE GRAPH-RECOGNIZERS AND REGULAR GRAPH-GRAMMARSWITT KU.1982; WORLD CONFERENCE ON MATHEMATICS AT THE SERVICE OF MAN. 2/1982-06-28/LAS PALMAS; ESP; DA. 1982; PP. 664-670; BIBL. 14 REF.Conference Paper

ON THE INFERENCE OF STOCHASTIC REGULAR GRAMMARS.VAN DER MUDE A; WALKER A.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 38; NO 3; PP. 310-329; BIBL. 19 REF.Article

Experiments and comparison of inference methods of regular grammars = Expériences et comparaison des méthodes d'inférence de grammaires régulièresGRÖNFORS, T; JUHOLA, M.IEEE transactions on systems, man, and cybernetics. 1992, Vol 22, Num 4, pp 821-826, issn 0018-9472Article

On the power of cooperation : a regular representation of recursively enumerable languagesCSUHAJ-VARJU, E; KELEMEN, J.Theoretical computer science. 1991, Vol 81, Num 2, pp 305-310, issn 0304-3975Article

A strip-like tiling algorithmMERLINI, Donatella; SPRUGNOLI, Renzo; VERRI, M. Cecilia et al.Theoretical computer science. 2002, Vol 282, Num 2, pp 337-352, issn 0304-3975Conference Paper

Inference of finite-state transducers by using regular grammars and morphismsCASACUBERTA, F.Lecture notes in computer science. 2000, pp 1-14, issn 0302-9743, isbn 3-540-41011-2Conference Paper

On the equivalence and containment problems for unambigous regular expressions, regular grammars and finite automataSTEARNS, R. E; HUNT, H. B. III.SIAM journal on computing (Print). 1985, Vol 14, Num 3, pp 598-611, issn 0097-5397Article